我们展示了一种简单，高效的“直接学习”方法来利用神经网络培训基于Volterra系列的数字预失真滤波器。我们使用64-QAM 64-GBaud模拟发射器显示出对传统训练方法的卓越性能，具有不同的发射器非线性和嘈杂的条件。
translated by 谷歌翻译
Protein structure prediction is a fundamental problem in computational molecular biology. Classical algorithms such as ab-initio or threading as well as many learning methods have been proposed to solve this challenging problem. However, most reinforcement learning methods tend to model the state-action pairs as discrete objects. In this paper, we develop a reinforcement learning (RL) framework in a continuous setting and based on a stochastic parametrized Hamiltonian version of the Pontryagin maximum principle (PMP) to solve the side-chain packing and protein-folding problem. For special cases our formulation can be reduced to previous work where the optimal folding trajectories are trained using an explicit use of Langevin dynamics. Optimal continuous stochastic Hamiltonian dynamics folding pathways can be derived with use of different models of molecular energetics and force fields. In our RL implementation we adopt a soft actor-critic methodology however we can replace this other RL training based on A2C, A3C or PPO.
translated by 谷歌翻译
Recently, Robey et al. propose a notion of probabilistic robustness, which, at a high-level, requires a classifier to be robust to most but not all perturbations. They show that for certain hypothesis classes where proper learning under worst-case robustness is \textit{not} possible, proper learning under probabilistic robustness \textit{is} possible with sample complexity exponentially smaller than in the worst-case robustness setting. This motivates the question of whether proper learning under probabilistic robustness is always possible. In this paper, we show that this is \textit{not} the case. We exhibit examples of hypothesis classes $\mathcal{H}$ with finite VC dimension that are \textit{not} probabilistically robustly PAC learnable with \textit{any} proper learning rule. However, if we compare the output of the learner to the best hypothesis for a slightly \textit{stronger} level of probabilistic robustness, we show that not only is proper learning \textit{always} possible, but it is possible via empirical risk minimization.
translated by 谷歌翻译
Large language models (LLMs) have been shown to be able to perform new tasks based on a few demonstrations or natural language instructions. While these capabilities have led to widespread adoption, most LLMs are developed by resource-rich organizations and are frequently kept from the public. As a step towards democratizing this powerful technology, we present BLOOM, a 176B-parameter open-access language model designed and built thanks to a collaboration of hundreds of researchers. BLOOM is a decoder-only Transformer language model that was trained on the ROOTS corpus, a dataset comprising hundreds of sources in 46 natural and 13 programming languages (59 in total). We find that BLOOM achieves competitive performance on a wide variety of benchmarks, with stronger results after undergoing multitask prompted finetuning. To facilitate future research and applications using LLMs, we publicly release our models and code under the Responsible AI License.
translated by 谷歌翻译
The inception of large language models has helped advance state-of-the-art performance on numerous natural language tasks. This has also opened the door for the development of foundation models for other domains and data modalities such as images, code, and music. In this paper, we argue that business process data representations have unique characteristics that warrant the development of a new class of foundation models to handle tasks like process mining, optimization, and decision making. These models should also tackle the unique challenges of applying AI to business processes which include data scarcity, multi-modal representations, domain specific terminology, and privacy concerns.
translated by 谷歌翻译
Observational studies have recently received significant attention from the machine learning community due to the increasingly available non-experimental observational data and the limitations of the experimental studies, such as considerable cost, impracticality, small and less representative sample sizes, etc. In observational studies, de-confounding is a fundamental problem of individualised treatment effects (ITE) estimation. This paper proposes disentangled representations with adversarial training to selectively balance the confounders in the binary treatment setting for the ITE estimation. The adversarial training of treatment policy selectively encourages treatment-agnostic balanced representations for the confounders and helps to estimate the ITE in the observational studies via counterfactual inference. Empirical results on synthetic and real-world datasets, with varying degrees of confounding, prove that our proposed approach improves the state-of-the-art methods in achieving lower error in the ITE estimation.
translated by 谷歌翻译
自然界中多元化的生态学在许多物种中具有各种形式的群体行为。蝴蝶物种是随机飞行的突出物种之一，有点有见地，并将其转化为人造隐喻将导致巨大的可能性。本文认为一种这种隐喻称为蝴蝶交配优化（BMO）。在BMO中，BFLE遵循巡逻的交配现象，并同时捕获了多模式函数的所有局部优势。为了模仿该算法，设计了一个移动机器人（BFlyBot），以满足BMO算法中BFLE的功能。此外，多Bflybot群的设计旨在像蝴蝶本质上的作用，并遵循该算法的规则。实时实验是在多动物领域的BMO算法上进行的，并将信号源视为光源。实验结果表明，BMO算法适用于检测多个信号源，其运动的变化显着，即静态和动态。在静态信号源的情况下，随着BFlybot的初始位置的不同，收敛性在时间和平稳性方面受到影响。而具有不同阶梯尺寸的实验会导致它们在机器人的执行时间和速度方面的变化。在这项工作中，在动态环境中进行了实验，在该环境中，信号源在操纵和非操作场景中的运动。 Bflybot群能够检测到单个和多信号源，在两个固定点之间在两个固定点之间进行线性移动，以圆形，向上和向下运动。评估BMO现象，各种正在进行的和前瞻性的作品，例如中海船舶检测，讨论了空中搜索应用和地震预测。
translated by 谷歌翻译
常规生成订单3及以上的数据张量。这些数据收集越来越大且增长。它们要么是张量字段（例如，图像，视频，地理数据），其中每个数据位置包含重要信息或排列不变的一般张量（例如，无监督的潜在空间学习，图形网络分析，建议系统等）。直接访问如此大的数据张量收集以获取信息已变得越来越令人难以置信。我们学习具有分解表示的近似全级和紧凑的张量草图，可提供紧凑的空间，时间和光谱嵌入量的张量场（P-SCT）和一般张量（P-SCT-Permute）。所有后续的信息查询都以高精度进行，在生成草图上进行。我们通过从张量切片的样品有效的子采样量构建张量图来产生任意阶数据张量的最佳级别-r tucker分解。我们的样本有效策略是通过使用与共轭先验的Dirichlet分布的适应性随机汤普森采样来学习的。
translated by 谷歌翻译
ML-AS-A-Service继续增长，对非常强大的隐私保证的需求也在继续增长。安全推断已成为潜在的解决方案，其中加密原始图允许推理不向用户向用户揭示用户的输入或模型的权重。例如，模型提供商可以是一家诊断公司，该公司已经培训了一种最先进的Densenet-121模型来解释胸部X射线，并且用户可以在医院成为患者。尽管对于这种环境，确保推理原则上是可行的，但没有现有的技术使其大规模实用。 Cryptflow2框架提供了一种潜在的解决方案，其能力自动，正确地将清晰文本推理转换为安全模型的推断。但是，从Cryptflow2产生的安全推断在不切实际上很昂贵：在Densenet-121上解释单个X射线需要几乎3TB的通信。在本文中，我们解决了针对三项贡献的安全推断效率低下的重大挑战。首先，我们证明安全推理中的主要瓶颈是大型线性层，可以通过选择网络骨干的选择来优化，并使用用于有效的清晰文本推理开发的操作员。这一发现和强调与许多最近的作品偏离，这些作品着重于在执行较小网络的安全推断时优化非线性激活层。其次，基于对瓶颈卷积层的分析，我们设计了一个更有效的倒入替代品的X操作器。第三，我们表明，快速的Winograd卷积算法进一步提高了安全推断的效率。结合使用，这三个优化被证明对在CHEXPERT数据集中训练的X射线解释问题非常有效。
translated by 谷歌翻译
饮食摄入量的评估主要依赖于自我报告工具，后者容易出现测量错误。饮食评估方法越来越多地纳入了技术进步，特别是基于图像的方法，以解决这些局限性和进一步的自动化。基于图像的方法可以通过自动估算由移动设备捕获的图像来自动估算饮食摄入量来减轻用户负担和偏见。在本文中，我们提出了一个“能量密度图”，该图是从RGB图像到食物的能量密度的像素到像素映射。然后，我们将“能量密度图”与相关的深度图合并在一起，该图由深度传感器捕获以估计食物能量。在Nutrition5K数据集上评估了所提出的方法。实验结果表明，与基线方法相比，结果的改善，平均误差为13.29 kcal，平均误差的平均百分比误差为13.57％，而食物的估计能量的平均百分比误差为13.57％。
translated by 谷歌翻译